Worst Possible Condition Number of Polynomial Systems
نویسنده
چکیده
A worst case bound for the condition number of a generic system of polynomial equations with integer coefficients is given. For fixed degree and number of equations, the condition number is (non-uniformly, generically) pseudo-polynomial in the input size.
منابع مشابه
A Generic Worst-case Bound on the Condition Number of a Homotopy Path
The number of steps of homotopy algorithms for solving systems of polynomials is usually bounded by the condition number of the homotopy path. A generic bound on the condition number of homotopy path between systems with integer coefficients will be given.
متن کاملProbability against Condition Number and Sampling of Multivariate Trigonometric Random Polynomials
PROBABILITY AGAINST CONDITION NUMBER AND SAMPLING OF MULTIVARIATE TRIGONOMETRIC RANDOM POLYNOMIALS ALBRECHT BÖTTCHER AND DANIEL POTTS Abstract. The difficult factor in the condition number of a large linear system is the spectral norm of . To eliminate this factor, we here replace worst case analysis by a probabilistic argument. To be more precise, we randomly take from a ball with the uniform ...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملOn the Worst-case Convergence of Mr and Cg for Symmetric Positive Definite Tridiagonal Toeplitz Matrices
We study the convergence of the minimal residual (MR) and the conjugate gradient (CG) method when applied to linear algebraic systems with symmetric positive definite tridiagonal Toeplitz matrices. Such systems arise, for example, from the discretization of one-dimensional reaction-diffusion equations with Dirichlet boundary conditions. Based on our previous results in [J. Liesen and P. Tichý, ...
متن کاملEstimating the domain of attraction for non-polynomial systems via LMI optimizations
This paper proposes a strategy for estimating the DA (domain of attraction) for non-polynomial systems via LFs (Lyapunov functions). The idea consists of converting the non-polynomial optimization arising for a chosen LF in a polynomial one, which can be solved via LMI optimizations. This is achieved by constructing an uncertain polynomial linearly affected by parameters constrained in a polyto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995